Complexity Results for Modal Dependence Logic

Modal dependence logic was introduced recently by Väänänen. It enhances the basic modal language by an operator =(). For propositional variables p1, . . . , pn, =(p1, . . . , pn−1, pn) intuitively states that the value of pn is determined by those of p1, . . . , pn−1. Sevenster (J. Logic and Computation, 2009) showed that satisfiability for modal dependence logic is complete for nondeterministic exponential time. In this paper we consider fragments of modal dependence logic obtained by restricting the set of allowed propositional connectives. We show that satisfibility for poor man’s dependence logic, the language consisting of formulas built from literals and dependence atoms using ∧, , ♦ (i. e., disallowing disjunction), remains NEXPTIME-complete. If we only allow monotone formulas (without negation, but with disjunction), the complexity drops to PSPACE-completeness. We also extend Väänänen’s language by allowing classical disjunction besides dependence disjunction and show that the satisfiability problem remains NEXPTIME-complete. If we then disallow both negation and dependence disjunction, satistiability is complete for the second level of the polynomial hierarchy. Additionally we consider the restriction of modal dependence logic where the length of each single dependence atom is bounded by a number that is fixed for the whole logic. We show that the satisfiability problem for this bounded arity dependence logic is PSPACE-complete and that the complexity drops to the third level of the polynomial hierarchy if we then disallow disjunction. In this way we completely classifiy the computational complexity of the satisfiability problem for all restrictions of propositional and dependence operators considered by Väänänen and Sevenster. A short version of this was presented at CSL 2010 [LV10].